Implementasi Algoritma K-Means dan C-Means untuk Clustering Angka Kemiskinan

نویسندگان

چکیده

Poverty is one of the problems that must be faced by developing countries, including Indonesia and especially province West Java. This problem exacerbated Covid-19 pandemic. can also have other consequences, such as increased crime death. To facilitate government programs support, it necessary to group cities/districts according poverty level. The analysis was carried out using K-Means Fuzzy C-Means algorithms with Silhouette method obtain optimal number clusters RStudio tools. purpose this study compare which algorithm based on Davis-Bouldin Index validation test. Three five data generated, give same results. Only education different Based results Davies-Bouldin test, fuzzy c-means k-means show better at clustering an average 4.084271. Meanwhile, has score 4.111375. smaller value or closer 0 shows how good cluster is.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Persistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm

Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...

متن کامل

Bilateral Weighted Fuzzy C-Means Clustering

Nowadays, the Fuzzy C-Means method has become one of the most popular clustering methods based on minimization of a criterion function. However, the performance of this clustering algorithm may be significantly degraded in the presence of noise. This paper presents a robust clustering algorithm called Bilateral Weighted Fuzzy CMeans (BWFCM). We used a new objective function that uses some k...

متن کامل

RK-Means Clustering: K-Means with Reliability

This paper presents an RK-means clustering algorithm which is developed for reliable data grouping by introducing a new reliability evaluation to the K-means clustering algorithm. The conventional K-means clustering algorithm has two shortfalls: 1) the clustering result will become unreliable if the assumed number of the clusters is incorrect; 2) during the update of a cluster center, all the d...

متن کامل

Adaptive K-Means Clustering

Clustering is used to organize data for efficient retrieval. One of the problems in clustering is the identification of clusters in given data. A popular technique for clustering is based on K-means such that the data is partitioned into K clusters. In this method, the number of clusters is predefined and the technique is highly dependent on the initial identification of elements that represent...

متن کامل

Constrained K-Means Clustering

We consider practical methods for adding constraints to the K-Means clustering algorithm in order to avoid local solutions with empty clusters or clusters having very few points. We often observe this phenomena when applying K-Means to datasets where the number of dimensions is n 10 and the number of desired clusters is k 20. We propose explicitly adding k constraints to the underlying clusteri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Expert: Jurnal Sistem Informasi

سال: 2023

ISSN: ['2745-7265', '2088-5555']

DOI: https://doi.org/10.36448/expert.v13i1.3107